On Burdet and Johnson's Algorithm for Integer Programming

In this paper, some deficiencies of a method proposed by Burdet and Johnson in 1977 for solving integer programming problems are discussed. Examples where the algorithm fails to solve the IP and ways to fix these errors are given

On Burdet and Johnson's Algorithm for Integer Programming

In this paper, some deficiencies of a method proposed by Burdet and Johnson in 1977 for solving integer programming problems are discussed. Examples where the algorithm fails to solve the IP and ways to fix these errors are given

Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator Functions

We introduce generalized subadditive generator functions for mixed integer linear programs. Our results extend Klabjan’s work from pure integer programs with nonnegative entries to general MILPs. These functions suffice to achieve strong subadditive duality. Several properties of the functions are shown. We then use this class of functions to generate certificates of optimality for MILPs. We have performed a computational test study on knapsack problems to investigate the efficiency of the certificates